Distributed Search Methods for Quantified Distributed Constraint Optimization Problem
نویسندگان
چکیده
منابع مشابه
Distributed Search Methods for Quantified Distributed Constraint Optimiza- tion Problem
Distributed Constraint Optimization problems (DCOPs) have been studied as a fundamental model of multiagent cooperation. In traditional DCOPs, all agents cooperate to optimize the sum of their cost functions. However, in practical systems some agents may desire to select the value of their variables without cooperation. In special cases, such agents may take the values with the worst impact on ...
متن کاملA quantified distributed constraint optimization problem
! " # " # # # $ ! # # % " % # ! ! # # # # " % ! # & % # % # ' % ( ! & # # ! ! ) ! % & ! " % % ! % & ! # % ! # # * # ! # % ! * ! & ) # % ! % ! ! ' # # " # " " ! % & ! % # ! # " % " + % # % ! " + # # # # , ! ( ) + "
متن کاملAnytime local search for distributed constraint optimization
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small problems. Distributed local search algorithms can be used for solving DisCOPs. However, because of the differences between the global evaluation of a system’s state and the private evaluation of states by agents, agents ar...
متن کاملCooperative problem solving against adversary: quantified distributed constraint satisfaction problem
In this paper, we extend the traditional formalization of distributed constraint satisfaction problems (DisCSP) to a quantified DisCSP. A quantified DisCSP includes several universally quantified variables, while all of the variables in a traditional DisCSP are existentially quantified. A universally quantified variable represents a choice of nature or an adversary. A quantified DisCSP formaliz...
متن کاملExploiting Problem Structure for Distributed Constraint Optimization
Distributed constraint optimization imposes considerable complexity in agents’ coordinated search for an optimal solution. However, in many application domains, problems often exhibit special structures that can be exploited to facilitate more efficient problem solving. One of the most recurrent structures involves disparity among subpmblems. We present a coordination mechanism, Anchor&Ascend, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence
سال: 2013
ISSN: 1346-0714,1346-8030
DOI: 10.1527/tjsai.28.43